Binary Decision Diagrams : An Improved Variable Ordering using Graph Representation of Boolean Functions
نویسندگان
چکیده
method to obtain the minimum number of nodes in Reduced Ordered Binary Decision Diagrams (ROBDD). The proposed method uses the graph topology to find the best variable ordering. Therefore the input Boolean function is converted to a unidirectional graph. Three levels of graph parameters are used to increase the probability of having a good variable ordering. The initial level uses the total number of nodes (NN) in all the paths, the total number of paths (NP) and the maximum number of nodes among all paths (MNNAP). The second and third levels use two extra parameters: The shortest path among two variables (SP) and the sum of shortest path from one variable to all the other variables (SSP). A permutation of the graph parameters is performed at each level for each variable order and the number of nodes is recorded. Experimental results are promising; the proposed method is found to be more effective in finding the variable ordering for the majority of benchmark circuits.
منابع مشابه
VARIABLE ORDERINGS FOR OBDDs, SIMULATED ANNEALING, AND THE HIDDEN WEIGHTED BIT FUNCTION
Ordered binary decision diagrams (OBDDs) are an eecient graph representation for Boolean functions, if good variable orderings are used. Variable order-ings are computed by heuristic algorithms and improved with the simulated annealing approach. New neighborhoods for simulated annealing algorithms are presented. It is investigated how the OBDD size may change in one iteration step for the diier...
متن کاملA Theoretical Study on Variable Ordering of ZBDDs for Representing Frequent Itemsets
(Abstract) Recently, an efficient method of database analysis using Zero-suppressed Binary Decision Diagrams (ZBDDs) has been proposed. BDDs are a graph-based representation of Boolean functions, now widely used in system design and verification. Here we focus on ZBDDs, a special type of BDDs, which are suitable for handling large-scale combinatorial itemsets in frequent item-set mining. In gen...
متن کاملGenetic Algorithm for Variable Ordering of Ordered Binary Decision Diagrams
Ordered Binary Decision Diagrams are a data structure for representation and manipulation of Boolean functions often applied in VLSI design. The choice of the variable ordering largely influences the size of these structures, size which may vary from polynomial to exponential in the number of variables. A genetic algorithm is applied to find a variable ordering that minimizes the size of ordere...
متن کاملOrdered Binary Decision Diagrams, Graph Theory and Computational Geometry AUTHORS
Ordered binary decision diagrams (OBDDs in short) have been shown as a powerful paradigm in handling Boolean functions and have been applied to many elds such as VLSI CAD, AI, combinatorics, etc. In this paper, we consider Boolean functions representing some concepts in graph theory such as spanning trees, matchings, cliques, etc., as well as concepts in computational geometry such as planar tr...
متن کاملOptimization of Bdd by Chaotic Evolution Algorithm and Its Application in Test of Stuck- Open Faults in Digital Circuits
The binary decision diagram (BDD) is an efficient graph representation of logic Boolean functions, it has wide applications in a lot of areas, such as computer science, circuit design and test. The size of binary decision diagram depends on the variable ordering which is used. A new approach is presented in this paper for the variable ordering and the optimization of binary decision diagrams, t...
متن کامل